A Quick Algorithm to Determine 2-Optimality Consensus for Collectives
نویسندگان
چکیده
منابع مشابه
a new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولA Faster Quick Search Algorithm
We present the FQS (faster quick search) algorithm, an improved variation of the quick search algorithm. The quick search (QS) exact pattern matching algorithm and its variants are among the fastest practical matching algorithms today. The FQS algorithm computes a statistically expected shift value, which allows maximal shifts and a smaller number of comparisons between the pattern and the text...
متن کاملAn optimality criterion to determine areas of endemism.
A formal method was developed to determine areas of endemism. The study region is divided into cells, and the number of species that can be considered as endemic is counted for a given set of cells (= area). Thus, the areas with the maximum number of species considered endemic are preferred. This is the first method for the identification of areas of endemism that implements an optimality crite...
متن کاملQuick fuzzy backpropagation algorithm
A modification of the fuzzy backpropagation (FBP) algorithm called QuickFBP algorithm is proposed, where the computation of the net function is significantly quicker. It is proved that the FBP algorithm is of exponential time complexity, while the QuickFBP algorithm is of polynomial time complexity. Convergence conditions of the QuickFBP, resp. the FBP algorithm are defined and proved for: (1) ...
متن کامل7.3 Algorithm to Determine Entailment
14 it is not possible to identify whether a type error is caused by an error in a function deenition or in an application of that function. In our system the error is always reported at the application site. Errors in type signatures are another matter: when a signature is found not to be an instance of the inferred type, we simply report the inferred type and the constraint that failed during ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3043371